import java.io.*;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.StringTokenizer;

class Read // 自定义快速读入
{
    StringTokenizer st = new StringTokenizer("");
    BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
    String next() throws IOException
    {
        while(!st.hasMoreTokens())
        {
            st = new StringTokenizer(bf.readLine());
        }
        return st.nextToken();
    }

    String nextLine() throws IOException
    {
        return bf.readLine();
    }

    int nextInt() throws IOException
    {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException
    {
        return Long.parseLong(next());
    }

    double nextDouble() throws IOException
    {
        return Double.parseDouble(next());
    }

    public boolean hasNextInt() throws IOException{
        return Boolean.parseBoolean(next());
    }
}
public class Day3 {
    public static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    public static Read in = new Read();

    public static void main(String[] args)throws IOException {
        int x = in.nextInt();
        System.out.println(x);
    }

    //1.
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextLine()) { // 注意 while 处理多个 case
            String str = in.nextLine();
            StringBuilder sb = new StringBuilder();
            String[] tmp = str.split(" ");
            for (int i = 0; i < tmp.length; i++) {
                char t = tmp[i].charAt(0);
                t = Character.toUpperCase(t);
                sb.append(t);
            }
            str = sb.toString();
            System.out.println(str);
        }
    }

    //2.dd爱框框
    public static void main2(String[] args) throws IOException{
         // 注意 while 处理多个 case
            Read in = new Read();
            int n = in.nextInt();
            int x = in.nextInt();
            int[] a = new int[n+1];
            for (int i = 1; i < n+1; i++) {
                a[i] = in.nextInt();
            }
            int len = Integer.MAX_VALUE;
            long sum=0;//记录窗口
            int l=0;
            int r=0;
            //求最短的区间内元素之和大于x
            int left=1;
            for (int right=1; right < n+1 ; right++) {
                sum+=a[right];
                while (sum>=x) {
                    if(right-left+1 < len) {
                        len = Math.min(len,right-left+1);
                        l=left;
                        r = right;
                    }
                    sum-=a[left++];
                }
            }
            System.out.println(l+" "+r);




    }
    //3.
    public static void main3(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            int n = in.nextInt();
            int k = in.nextInt();
            int[] a=new int[n];
            long sum=0;
            PriorityQueue<Integer> queue = new PriorityQueue(new Comparator() {
                @Override
                public int compare(Object o1, Object o2) {
                    return (Integer) o2-(Integer) o1;
                }
            });
            for (int i = 0; i < n; i++) {
                a[i]=in.nextInt();
                if(a[i]%2==0) {
                    queue.add(a[i]);
                }
                sum+=a[i];
            }
            while (queue.size()!=0 && k!=0) {
                int tmp = queue.poll()/2;
                k--;
                sum-=tmp;
                if(tmp%2==0) {
                    queue.add((int)tmp);
                }
            }
            System.out.println(sum);
        }
    }

}
